Identifying Minimalist Languages from Dependency Structures

نویسندگان

  • Edward Stabler
  • Edward Keenan
  • Greg Kobele
  • Charles Taylor
  • Travis Collier
چکیده

The human acquisition of human languages is is based on the analysis of signal and context. To study how this might work, a simplified robotic setting is described in which the problem is divided into two basic steps: an analysis of the linguistic events in context that yields dependency structures, and the identification of grammars that generate those structures. A learnability result that generalizes (Kanazawa 1994) has been obtained, showing that non-CF, and even non-TAG languages can be identified in this setting, andmore realistic assessments of the learning problem are under study. Human languages are complex, and it is a challenge to find strategies which will let us understand their components. (In the same way, the physical properties of the table that my papers are on is complex, and so it is no surprise that physicists and chemists do not directly study tables, but simpler components of tables, first.) The strategy I will describe here is to study some things that are similar to human languages in some crucial respects, but otherwise very much simpler. Imagine a simplified language learner who cannot speak or hear but only read and write. Imagine this learner can see and reason (but perhaps only in some quite primitive ways), and that this learner encounters expressions – character sequences – like this in certain perceptual and cognitive contexts. language learned in context John ’s eat -ing cookie -s covariation with context: choice of elements: John vs Bill, eat vs buy, cookie vs pie configuration: cookies, John’s eating s’John eating cookies?

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dependency Structures Derived from Minimalist Grammars

This paper provides an interpretation of Minimalist Grammars [16,17] in terms of dependency structures. Under this interpretation, merge operations derive projective dependency structures, and movement operations introduce both non-projectivity and illnestedness. This new characterization of the generative capacity of Minimalist Grammar makes it possible to discuss the linguistic relevance of n...

متن کامل

A Broad-Coverage, Representationally Minimalist LFG-like Parser: Chunks and F-Structures Are Enough

Tesnière’s concept of Functional Dependency Grammar can be seen as a monostratal LFG that only knows F-structure. Combining Frank’s projection of F-structures from chunks model with statistical techniques we build a parser that outputs LFG F-structure like structures, is representationally minimalist, combines shallow and deep analysis, is deep-linguistic, robust, fast, psycholinguistically pla...

متن کامل

Minimalist Tree Languages Are Closed Under Intersection with Recognizable Tree Languages

Minimalist grammars are a mildly context-sensitive grammar framework within which analyses in mainstream chomskyian syntax can be faithfully represented. Here it is shown that both the derivation tree languages and derived tree languages of minimalist grammars are closed under intersection with regular tree languages. This allows us to conclude that taking into account the possibility of ‘seman...

متن کامل

Setting parametric limits on dialectal variation in Spanish*

The present investigation departs from the perspective that dialects of languages may exemplify typological distinctions, and as such, may be defined within parametric limits. More specifically, this synchronic study focuses on the interand intra-dialectal variation attested within the Spanish language, heretofore exempted from the scrutiny that has characterized syntactic studies of other Roma...

متن کامل

Geometric representations for minimalist grammars

We reformulate minimalist grammars as partial functions on term algebras for strings and trees. Using filler/role bindings and tensor product representations, we construct homomorphisms for these data structures into geometric vector spaces. We prove that the structure-building functions as well as simple processors for minimalist languages can be realized by piecewise linear operators in repre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002